Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollobas, and Sorkin (2004) and by Aigner and van der Holst (2004). We present an algorithm to evaluate the multivariate interlace polynomial of a graph with n vertices given a tree decomposition of the graph of width k. The best previously known result (Courcelle 2008) employs a general logical framework and leads to an algorithm with running time f(k)*n, where f(k) is doubly exponential in k. Analyzing the GF(2)-rank of adjacency matrices in the context of tree decompositions, we give a faster and more direct algorithm. Our algorithm uses 2^{3k^2+O(k)}*n arithmetic operations and can be efficiently implemented in parallel.Comment: v4: Minor error in Lemma 5.5 fixed, Section 6.6 added, minor improvements. 44 pages, 14 figure

Solving Problems on Graphs of High Rank-Width

A modulator of a graph G to a specified graph class H is a set of vertices whose deletion puts G into H. The cardinality of a modulator to various tractable graph classes has long been used as a structural parameter which can be exploited to obtain FPT algorithms for a range of hard problems. Here we investigate what happens when a graph contains a modulator which is large but "well-structured" (in the sense of having bounded rank-width). Can such modulators still be exploited to obtain efficient algorithms? And is it even possible to find such modulators efficiently? We first show that the parameters derived from such well-structured modulators are strictly more general than the cardinality of modulators and rank-width itself. Then, we develop an FPT algorithm for finding such well-structured modulators to any graph class which can be characterized by a finite set of forbidden induced subgraphs. We proceed by showing how well-structured modulators can be used to obtain efficient parameterized algorithms for Minimum Vertex Cover and Maximum Clique. Finally, we use well-structured modulators to develop an algorithmic meta-theorem for deciding problems expressible in Monadic Second Order (MSO) logic, and prove that this result is tight in the sense that it cannot be generalized to LinEMSO problems.Comment: Accepted at WADS 201

Compact Labelings For Efficient First-Order Model-Checking

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is \emph{nicely locally cwd-decomposable}. This notion generalizes that of a \emph{nicely locally tree-decomposable} class. The graphs of such classes can be covered by graphs of bounded \emph{clique-width} with limited overlaps. We also consider such labelings for \emph{bounded} first-order formulas on graph classes of \emph{bounded expansion}. Some of these results are extended to counting queries

Development of an airline revenue capability model for aircraft design

Typically value based approaches to the design of civil and commercial aircraft, be they net present value, surplus value, or any other utility based approach focus solely on the difference in cost between the alternatives, neglecting changes in revenue which might occur between the two concepts. Alternatively, if they do have a revenue focus, it is based upon simple relationships between payload capacity and revenue, assuming a either a fixed protfimargin or fixed yield. This approach works well when comparing two similar or closely related concepts, but falls apart when investigating more radically di erent systems, e.g. a cruise eficient short take-o and landing concept. By using a value based approach it is relatively simple to structure a decision model to incorporate changing revenue capability. However, the ability to investigate differences in design is very much dependent upon the revenue model and assumptions that are made. If the revenue elasticity is the same forthe two concepts then there is no benefi t in using a variable revenue approach. However, in the cases where the elasticity is different, the revenue approach offers the potential to more properly investigate some fundamentally different alternative concepts. © 2010 by Peter Sutcliffe & Peter Hollingsworth. Published by the American Institute of Aeronautics and Astronautics, Inc

On the Monadic Second-Order Transduction Hierarchy

We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K). If we only consider classes of incidence structures we can completely describe the resulting hierarchy. It is linear of order type {\omega}+3. Each level can be characterised in terms of a suitable variant of tree-width. Canonical representatives of the various levels are: the class of all trees of height n, for each n \in N, of all paths, of all trees, and of all grids

Parameterized Edge Hamiltonicity

We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W-hard for clique-width. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke

B2B e-marketplaces in the airline industry:process drivers and performance indicators

Competitive pressures are increasing within and between different strategically oriented groups of airlines. This paper focuses on the level of efficiency improvements gained by using e-Marketplaces in the procurement process. Findings from a survey among 88 international airlines reveal that the use of Business-to-Business (B2B) e-Marketplaces does play different roles across the various airline groupings. Airlines that are involved in strategic alliances show higher joint procurement activities than airlines that are not involved in strategic alliances. However, alliances are probably viewed as loose arrangements and thus airlines may be reluctant to share information on procurement prices and processes with another airline that could also be acting as a competitor. The financial involvement in or initiation of e-Marketplaces by airlines is very low. Low cost airlines show high use of e-Marketplaces, but demonstrate little financial involvement in contrast. Overall, the categories of spares and repairs, office supplies, tools and ground support equipment (GSE) show the greatest potential for reducing costs and increasing procurement process efficiencies. The intense competitive pressures facing carriers will make their search for tools to realise even incremental savings and efficiency gains ever more urgent. There is evidence that e-Marketplaces are one tool to improve such performance indicators

Using Web Search Query Data to Monitor Dengue Epidemics: A New Model for Neglected Tropical Disease Surveillance

A variety of obstacles, including bureaucracy and lack of resources, delay detection and reporting of dengue and exist in many countries where the disease is a major public health threat. Surveillance efforts have turned to modern data sources such as Internet usage data. People often seek health-related information online and it has been found that the frequency of, for example, influenza-related web searches as a whole rises as the number of people sick with influenza rises. Tools have been developed to help track influenza epidemics by finding patterns in certain web search activity. However, few have evaluated whether this approach would also be effective for other diseases, especially those that affect many people, that have severe consequences, or for which there is no vaccine. In this study, we found that aggregated, anonymized Google search query data were also capable of tracking dengue activity in Bolivia, Brazil, India, Indonesia and Singapore. Whereas traditional dengue data from official sources are often not available until after a long delay, web search query data is available for analysis within a day. Therefore, because it could potentially provide earlier warnings, these data represent a valuable complement to traditional dengue surveillance

Laboratory-based and office-based risk scores and charts to predict 10-year risk of cardiovascular disease in 182 countries: a pooled analysis of prospective cohorts and health surveys

Background: Worldwide implementation of risk-based cardiovascular disease (CVD) prevention requires risk prediction tools that are contemporarily recalibrated for the target country and can be used where laboratory measurements are unavailable. We present two cardiovascular risk scores, with and without laboratory-based measurements, and the corresponding risk charts for 182 countries to predict 10-year risk of fatal and non-fatal CVD in adults aged 40–74 years. Methods: Based on our previous laboratory-based prediction model (Globorisk), we used data from eight prospective studies to estimate coefficients of the risk equations using proportional hazard regressions. The laboratory-based risk score included age, sex, smoking, blood pressure, diabetes, and total cholesterol; in the non-laboratory (office-based) risk score, we replaced diabetes and total cholesterol with BMI. We recalibrated risk scores for each sex and age group in each country using country-specific mean risk factor levels and CVD rates. We used recalibrated risk scores and data from national surveys (using data from adults aged 40–64 years) to estimate the proportion of the population at different levels of CVD risk for ten countries from different world regions as examples of the information the risk scores provide; we applied a risk threshold for high risk of at least 10% for high-income countries (HICs) and at least 20% for low-income and middle-income countries (LMICs) on the basis of national and international guidelines for CVD prevention. We estimated the proportion of men and women who were similarly categorised as high risk or low risk by the two risk scores. Findings: Predicted risks for the same risk factor profile were generally lower in HICs than in LMICs, with the highest risks in countries in central and southeast Asia and eastern Europe, including China and Russia. In HICs, the proportion of people aged 40–64 years at high risk of CVD ranged from 1% for South Korean women to 42% for Czech men (using a ≥10% risk threshold), and in low-income countries ranged from 2% in Uganda (men and women) to 13% in Iranian men (using a ≥20% risk threshold). More than 80% of adults were similarly classified as low or high risk by the laboratory-based and office-based risk scores. However, the office-based model substantially underestimated the risk among patients with diabetes. Interpretation: Our risk charts provide risk assessment tools that are recalibrated for each country and make the estimation of CVD risk possible without using laboratory-based measurements